Polynomial-time approximation scheme

Results: 52



#Item
21There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract

There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2010-12-30 12:50:07
22All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T

All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2013-01-05 09:50:09
23CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics S¨oren Laue∗ Abstract

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics S¨oren Laue∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:24:48
24Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with

Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:22
25Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if,

Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if,

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:22
26Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes

Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:22
27Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes

Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:22
28Syntactic Characterizations of Polynomial Time Optimization Classes

Syntactic Characterizations of Polynomial Time Optimization Classes

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-07-07 17:48:07
29A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of

A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of

Add to Reading List

Source URL: tom.thesnail.org

Language: English - Date: 2015-05-04 03:09:24
30Budget Feasible Mechanisms for Experimental Design Thibaut Horel ´ Ecole Normale Sup´erieure

Budget Feasible Mechanisms for Experimental Design Thibaut Horel ´ Ecole Normale Sup´erieure

Add to Reading List

Source URL: thibaut.horel.org

Language: English - Date: 2015-01-22 00:44:30